On the probability of generating invariably a finite simple group
نویسندگان
چکیده
Let G be a finite simple group. In this paper we consider the existence of small subsets A with property that, if y∈G is chosen uniformly at random, then high probability y invariably generates together some element A. We prove various results in direction, both positive and negative. As corollary, that two randomly elements group Lie type bounded rank generate away from zero. Our method based on solution Boston–Shalev conjecture by Fulman Guralnick, as well certain connections between properties invariable generation structure its Weyl
منابع مشابه
On Probability of Generating a Finite Group
Let G be a finite group, and let φk(G) be the probability that k random group elements generate G. Denote by θ(G) the smallest k such that φk(G) > 1/e. In this paper we analyze quantity θ(G) for different classes of groups. We prove that θ(G) ≤ κ(G)+ 1 when G is nilpotent and κ(G) is the minimal number of generators of G. When G is solvable we show that θ(G) ≤ 3.25κ(G) + 107. We also show that ...
متن کاملThe Probability of Generating a Classical Group
In [KL] it is provcd that the probability of two randomly chosen elements of a finite dassical simple group G actually generating G tends to 1 as lei increases. If gEe, let Pu(g) be the probability that, if h is chosen randomly in G, then (g, h) IG. Let PG : = ma..x{Pu(g) I 9 E e#}. In [KL, Conjecture 2] it is suggested that a stronger result might hold: Pc ---4 0 as IGI ---4 00 for simple clas...
متن کاملThe probability of generating the symmetric group
In [2], Dixon considered the following question: " Suppose two permutations are chosen at random from the symmetric group Sn of degree n. What is the probability that they will generate Sn? " Actually, Netto conjectured last century that almost all pairs of elements from Sn will generate Sn or An. Dixon showed that this is true in the following sense: The proportion of ordered pairs (x, y) (x, ...
متن کاملOn the Graph of Generating Sets of a Simple Group
We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k ≥ 3. This is related to the recent conjecture of Diaconis and Graham. As an application, we also prove that the output of the product replacement algorithm (see [CLMNO]) in this case does not have a strong bias.
متن کاملthe effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2023
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2022.107284